A Newton-type Algorithm for the Solution of Inequality Constrained Minimization Problems
نویسندگان
چکیده
We describe a new Newton-type algorithm for the solution of inequality constrained minimization problems. The algorithm is based on an active-set strategy and, at each iteration, only requires the solution of one linear system. Under mild assumptions, and without requiring strict complementarity, we prove q-quadratic convergence of the primal variables towards the solution.
منابع مشابه
Quadratically and Superlinearly Convergent Algorithms for the Solution of Inequality Constrained Minimization Problems 1
In this paper some Newton and quasi-Newton algorithms for the solution of inequality constrained minimization problems are considered. All the algorithms described produce sequences fx k g converging q-superlinearly to the solution. Furthermore , under mild assumptions, a q-quadratic convergence rate in x is also attained. Other features of these algorithms are that the solution of linear syste...
متن کاملVOLUME MINIMIZATION WITH DISPLACEMENT CONSTRAINTS IN TOPOLOGY OPTIMIZATION OF CONTINUUM STRUCTURES
In this paper, a displacement-constrained volume-minimizing topology optimization model is present for two-dimensional continuum problems. The new model is a generalization of the displacement-constrained volume-minimizing model developed by Yi and Sui [1] in which the displacement is constrained in the loading point. In the original model the displacement constraint was formulated as an equali...
متن کاملA Hybrid Newton Method for Solving Box Constrained Variational Inequality Problems via the D-gap Function
A box constrained variational inequality problem can be reformulated as an unconstrained minimization problem through the D-gap function. A hybrid Newton-type method is proposed for minimizing the D-gap function. Under suitable conditions, the algorithm is shown to be globally convergent and locally quadratically convergent. Some numerical results are also presented.
متن کاملStrong convergence theorem for a class of multiple-sets split variational inequality problems in Hilbert spaces
In this paper, we introduce a new iterative algorithm for approximating a common solution of certain class of multiple-sets split variational inequality problems. The sequence of the proposed iterative algorithm is proved to converge strongly in Hilbert spaces. As application, we obtain some strong convergence results for some classes of multiple-sets split convex minimization problems.
متن کاملStrong convergence of a general implicit algorithm for variational inequality problems and equilibrium problems and a continuous representation of nonexpansive mappings
We introduce a general implicit algorithm for finding a common element of the set of solutions of systems of equilibrium problems and the set of common fixed points of a sequence of nonexpansive mappings and a continuous representation of nonexpansive mappings. Then we prove the strong convergence of the proposed implicit scheme to the unique solution of the minimization problem on the so...
متن کامل